Engineering Stochastic Local Search for the Low Autocorrelation Binary Sequence Problem

نویسندگان

  • Steven Halim
  • Roland H. C. Yap
  • Felix Halim
چکیده

This paper engineers a new state-of-the-art Stochastic Local Search (SLS) for the Low Autocorrelation Binary Sequence (LABS) problem. The new SLS solver is obtained with white-box visualization to get insights on how an SLS can be effective for LABS; implementation improvements; and black-box parameter tuning.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

GENETIC AND TABU SEARCH ALGORITHMS FOR THE SINGLE MACHINE SCHEDULING PROBLEM WITH SEQUENCE-DEPENDENT SET-UP TIMES AND DETERIORATING JOBS

 This paper introduces the effects of job deterioration and sequence dependent set- up time in a single machine scheduling problem. The considered optimization criterion is the minimization of the makespan (Cmax). For this purpose, after formulating the mathematical model, genetic and tabu search algorithms were developed for the problem. Since population diversity is a very important issue in ...

متن کامل

Stochastic solver for constraint satisfaction problems with learning of high-level characteristics of the problem topography

A new generic method for solving constraint satisfaction problems is presented. The method is based on stochastic search which is non-local in the sense that at any point in the search, the next state sampled may be arbitrarily far from the current state. The solver relies heavily on knowledge of the high-level characteristics of the topography defining the problem. It obtains these characteris...

متن کامل

Exploiting Relaxation in Local Search

Branch-and-bound uses relaxation to prune search trees but sometimes scales poorly to large problems. Conversely, local search often scales well but may be unable to find optimal solutions, perhaps because it does not exploit relaxation. Both phenomena occur in the construction of low-autocorrelation binary sequences, a problem arising in communication engineering. This paper proposes a hybrid ...

متن کامل

Using a new modified harmony search algorithm to solve multi-objective reactive power dispatch in deterministic and stochastic models

The optimal reactive power dispatch (ORPD) is a very important problem aspect of power system planning and is a highly nonlinear, non-convex optimization problem because consist of both continuous and discrete control variables. Since the power system has inherent uncertainty, hereby, this paper presents both of the deterministic and stochastic models for ORPD problem in multi objective and sin...

متن کامل

Traffic Condition Detection in Freeway by using Autocorrelation of Density and Flow

Traffic conditions vary over time, and therefore, traffic behavior should be modeled as a stochastic process. In this study, a probabilistic approach utilizing Autocorrelation is proposed to model the stochastic variation of traffic conditions, and subsequently, predict the traffic conditions. Using autocorrelation of the time series samples of density and flow which are collected from segments...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008